Lattice Paths, Sampling without Replacement, and the Kernel Method
نویسندگان
چکیده
In this work we consider weighted lattice paths in the quarter plane N0 × N0. The steps are given by (m, n) → (m − 1, n), (m, n) → (m, n − 1) and are weighted as follows: (m, n)→ (m− 1, n) by m/(m + n) and step (m, n)→ (m, n− 1) by n/(m + n). The considered lattice paths are absorbed at lines y = x/t− s/t with t ∈ N and s ∈ N0. We provide explicit formulæ for the sum of the weights of paths, starting at (m, n), which are absorbed at a certain height k at lines y = x/t−s/t with t ∈ N and s ∈ N0, using a generating functions approach and the kernel method. Furthermore these weighted lattice paths can be interpreted as probability distributions arising in the context of Pólya-Eggenberger urn models, more precisely, the lattice paths are sample paths of the well known sampling without replacement urn. We provide limiting distribution results for the underlying random variable, surprisingly obtaining a total of five phase changes.
منابع مشابه
Lattice Paths, Sampling Without Replacement, and Limiting Distributions
In this work we consider weighted lattice paths in the quarter plane N0 × N0. The steps are given by (m,n) → (m − 1, n), (m,n) → (m,n − 1) and are weighted as follows: (m,n) → (m − 1, n) by m/(m + n) and step (m,n) → (m,n − 1) by n/(m + n). The considered lattice paths are absorbed at lines y = x/t − s/t with t ∈ N and s ∈ N0. We provide explicit formulæ for the sum of the weights of paths, sta...
متن کاملOn Embedded Trees and Lattice Paths
Bouttier, Di Francesco and Guitter introduced a method for solving certain classes of algebraic recurrence relations arising the context of embedded trees and map enumeration. The aim of this note is to apply this method to three problems. First, we discuss a general family of embedded binary trees, trying to unify and summarize several enumeration results for binary tree families, and also to ...
متن کاملOn the Area under Lattice Paths Associated with Triangular Diminishing
This work is devoted to the analysis of the area under certain lattice paths. The lattice paths of interest are associated to a class of 2 × 2 triangular Pólya-Eggenberger urn models with ball replacement matrix M = (−a 0 c −d ) , with a, d ∈ N and c = p · a, p ∈ N0. We study the random variable counting the area under sample paths associated to these urn models, where we obtain a precise recur...
متن کاملLattice paths with catastrophes
In queuing theory, it is usual to have some models with a “reset” of the queue. In terms of lattice paths, it is like having the possibility of jumping from any altitude to zero. These objects have the interesting feature that they do not have the same intuitive probabilistic behaviour like classical Dyck paths (the typical properties of which are strongly related to Brownian motion theory), an...
متن کاملProbability Inequalities for Kernel Embeddings in Sampling without Replacement
The kernel embedding of distributions is a popular machine learning technique to manipulate probability distributions and is an integral part of numerous applications. Its empirical counterpart is an estimate from a finite set of samples from the distribution under consideration. However, for large-scale learning problems the empirical kernel embedding becomes infeasible to compute and approxim...
متن کامل